全文获取类型
收费全文 | 2348篇 |
免费 | 160篇 |
国内免费 | 71篇 |
专业分类
化学 | 73篇 |
晶体学 | 1篇 |
力学 | 4篇 |
综合类 | 29篇 |
数学 | 2374篇 |
物理学 | 98篇 |
出版年
2024年 | 2篇 |
2023年 | 46篇 |
2022年 | 62篇 |
2021年 | 44篇 |
2020年 | 98篇 |
2019年 | 92篇 |
2018年 | 86篇 |
2017年 | 86篇 |
2016年 | 57篇 |
2015年 | 47篇 |
2014年 | 80篇 |
2013年 | 210篇 |
2012年 | 68篇 |
2011年 | 126篇 |
2010年 | 127篇 |
2009年 | 231篇 |
2008年 | 185篇 |
2007年 | 138篇 |
2006年 | 146篇 |
2005年 | 86篇 |
2004年 | 84篇 |
2003年 | 82篇 |
2002年 | 69篇 |
2001年 | 57篇 |
2000年 | 57篇 |
1999年 | 24篇 |
1998年 | 24篇 |
1997年 | 23篇 |
1996年 | 21篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 13篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2579条查询结果,搜索用时 46 毫秒
51.
52.
The Laplacian spectrum of a graph consists of the eigenvalues (together with multiplicities) of the Laplacian matrix. In this article we determine, among the graphs consisting of disjoint unions of paths and cycles, those ones which are determined by the Laplacian spectrum. For the graphs, which are not determined by the Laplacian spectrum, we give the corresponding cospectral non-isomorphic graphs. 相似文献
53.
54.
55.
56.
给定2个图G 1 ![]()
![]()
和G 2 ![]()
![]()
,设G 1 ![]()
![]()
的边集E ( G 1 ) = { e 1 , e 2 , ? , e m 1 } ![]()
![]()
,则图G 1 ⊙ G 2 ![]()
![]()
可由一个G 1 ![]()
![]()
,m 1 ![]()
![]()
个G 2 ![]()
![]()
通过在G 1 ![]()
![]()
对应的每条边外加一个孤立点,新增加的点记为U = { u 1 , u 2 , ? , u m 1 } ![]()
![]()
,将u i ![]()
![]()
分别与第i ![]()
![]()
个G 2 ![]()
![]()
的所有点以及G 1 ![]()
![]()
中的边e i ![]()
![]()
的端点相连得到,其中i = ? 1,2 , ? , m 1 ![]()
![]()
。得到:(i)当G 1 ![]()
![]()
是正则图,G 2 ![]()
![]()
是正则图或完全二部图时,确定了G 1 ⊙ G 2 ![]()
![]()
的邻接谱(A -谱)。(ii)当G 1 ![]()
![]()
是正则图,G 2 ![]()
![]()
是任意图时,给出了G 1 ⊙ G 2 ![]()
![]()
的拉普拉斯谱(L -谱)。(iii)当G 1 ![]()
![]()
和G 2 ![]()
![]()
都是正则图时,给出了G 1 ⊙ G 2 ![]()
![]()
的无符号拉普拉斯谱(Q -谱)。作为以上结论的应用,构建了无限多对A -同谱图、L -同谱图和Q -同谱图;同时当G 1 ![]()
![]()
是正则图时,确定了G 1 ⊙ G 2 ![]()
![]()
支撑树的数量和Kirchhoff指数。 相似文献
57.
Given an ‐vertex pseudorandom graph and an ‐vertex graph with maximum degree at most two, we wish to find a copy of in , that is, an embedding so that for all . Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in . Here, we provide a deterministic polynomial time algorithm that finds a given in any suitably pseudorandom graph . The pseudorandom graphs we consider are ‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, . A ‐bijumbled graph is characterised through the discrepancy property: for any two sets of vertices and . Our condition on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications. 相似文献
58.
59.
In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most . In a separate paper, we showed that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph. The result was obtained by showing that the conjecture holds for a general class of graphs with some specific expansion‐type properties. In this paper, this deterministic result is used to show that the conjecture holds asymptotically almost surely for random d‐regular graphs when d = d(n) ≥ 3. 相似文献
60.
《Discrete Mathematics》2019,342(10):2770-2782
“Which graphs are determined by their spectrum (DS for short)?” is a fundamental question in spectral graph theory. It is generally very hard to show a given graph to be DS and few results about DS graphs are known in literature. In this paper, we consider the above problem in the context of the generalized -spectrum. A graph is said to be determined by the generalized -spectrum (DGQS for short) if, for any graph , and have the same -spectrum and so do their complements imply that is isomorphic to . We give a simple arithmetic condition for a graph being DGQS. More precisely, let be a graph with adjacency matrix and degree diagonal matrix . Let be the signless Laplacian matrix of , and ( is the all-ones vector) be the -walk matrix. We show that if (which is always an integer) is odd and square-free, then is DGQS. 相似文献